Clp(b) : Combining Simplicity and Eeciency in Boolean Constraint Solving
نویسندگان
چکیده
We present the design and the implementation of clp(B): a boolean constraint solver in the Constraint Logic Programming paradigm. This solver is based on local propagation methods and follows the \glass-box" approach of compiling high-level constraints into primitive low-level ones. We detail its integration into the WAM showing that the necessary extension is truly minimal since only four new instructions are added. The resulting solver is around an order of magnitude faster than other existing boolean solvers.
منابع مشابه
clp(B): Combining Simplicity and Efficiency in Boolean Constraint Solving
We present the design and the implementation of clp(B): a boolean constraint solver inside the Constraint Logic Programming paradigm. This solver is based on local propagation methods and follows the “glass-box” approach of compiling high-level constraints into primitive low-level ones. We detail its integration into the WAM showing that the necessary extension is truly minimal since only four ...
متن کاملAn Impartial Eeciency Comparison of Fd Constraint Systems
1 A one page summary will be published in the proceedings of the 1998 Conference on Constraint programming (CP'98) Abstract. This paper compares the eeciency of a number of Constraint Logic Programming (CLP) systems in the setting of nite domains. One of the main reasons for adopting CLP technology for solving a problem is the provision of an eecient implementation for the computationally expen...
متن کاملBoolean Constraint Solving Using clp(FD)
We present a boolean constraint logic language clp(B/FD) built upon a language over finite domains clp(FD) which uses a local propagation constraint solver. It is based on a single primitive constraint which allows the boolean solver to be encoded at a low-level. The boolean solver obtained in this way is both very simple and very efficient: on average it is eight times faster than the CHIP pro...
متن کاملCombining Uniication and Built-in Constraints (extended Abstract)
In less than a decade, Deduction with Constraints (DwC) has opened a new universe in computer science. DwC can be viewed from two perspectives: one related to the automated deduction framework 17, 19], the other to the development and usage of programming languages based on logic 7, 14]. Within the automated deduction framework, constraints on the generic data structure \terms" have become a po...
متن کاملCompiling Constraints in clp(FD)
We present the clp(FD) system: a Constraint Logic Programming language with finite domain constraints. We detail its implementation and present an abstract instruction set for the constraint solver that can be smoothly integrated into the WAM architecture. It is based on the use of a single primitive constraintX in r that embeds the core propagation mechanism. Complex user constraints such as l...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1994